Flip graphs for infinite type surfaces
نویسندگان
چکیده
We associate to triangulations of infinite type surfaces a flip graph where simultaneous flips are allowed. Our main focus is on understanding exactly when two can be related by sequence flips. A consequence our results that graphs for have uncountably many connected components.
منابع مشابه
Modular flip-graphs of one-holed surfaces
We study flip-graphs of triangulations on topological surfaces where distance is measured by counting the number of necessary flip operations between two triangulations. We focus on surfaces of positive genus g with a single boundary curve and n marked points on this curve; we consider triangulations up to homeomorphism with the marked points as their vertices. Our main results are upper and lo...
متن کاملGraphs of Curves on Infinite-type Surfaces with Mapping Class Group Actions
We study when the mapping class group of an infinite-type surface S admits an action with unbounded orbits on a connected graph whose vertices are simple closed curves on S. We introduce a topological invariant for infinite-type surfaces that determines in many cases whether there is such an action.
متن کاملPercolation-type Problems on Infinite Random Graphs
We study some percolation problems on the complete graph over N. In particular, we give sharp sufficient conditions for the existence of (finite or infinite) cliques and paths in a random subgraph. No specific assumption on the probability, such as independency, is made. The main tools are a topological version of Ramsey theory, exchangeability theory and elementary ergodic theory.
متن کاملTopological infinite gammoids, and a new Menger-type theorem for infinite graphs
Answering a question of Diestel, we develop a topological notion of gammoids in infinite graphs which, unlike traditional infinite gammoids, always define a matroid. As our main tool, we prove for any infinite graph G with vertex sets A and B that if every finite subset of A is linked to B by disjoint paths, then the whole of A can be linked to the closure of B by disjoint paths or rays in a na...
متن کاملMenger’s Theorem for Infinite Graphs
We prove that Menger’s theorem is valid for infinite graphs, in the following strong version: let A and B be two sets of vertices in a possibly infinite digraph. Then there exist a set P of disjoint A–B paths, and a set S of vertices separating A from B, such that S consists of a choice of precisely one vertex from each path in P. This settles an old conjecture of Erdős. 1. History of the probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Groups, Geometry, and Dynamics
سال: 2022
ISSN: ['1661-7207', '1661-7215']
DOI: https://doi.org/10.4171/ggd/685